Probabilistic Analysis of Electronic Systems via Adaptive Hierarchical Interpolation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

0 Electronic structure interpolation via atomic orbitals

We present an efficient scheme for accurate electronic structure interpolations based on the systematically improvable optimized atomic orbitals. The atomic orbitals are generated by minimizing the spillage value between the atomic basis calculations and the converged plane wave basis calculations on some coarse k-point grid. They are then used to calculate the band structure of the full Brillo...

متن کامل

Model Checking Hierarchical Probabilistic Systems

Probabilistic modeling is important for random distributed algorithms, bio-systems or decision processes. Probabilistic model checking is a systematic way of analyzing finite-state probabilistic models. Existing probabilistic model checkers have been designed for simple systems without hierarchy. In this paper, we extend the PAT toolkit to support probabilistic model checking of hierarchical co...

متن کامل

Stability analysis of fractional-order nonlinear Systems via Lyapunov method

‎In this paper‎, ‎we study stability of fractional-order nonlinear dynamic systems by means of Lyapunov‎ ‎method‎. ‎To examine the obtained results‎, ‎we employe the developed techniques on test examples‎.

متن کامل

Constrained Interpolation via Cubic Hermite Splines

Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation.  It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...

متن کامل

Analysis of Probabilistic Systems via Generating Functions and Padé Approximation

We investigate the use of generating functions in the analysis of discrete Markov chains. Generating functions are introduced as power series whose coefficients are certain hitting probabilities. Being able to compute such functions implies that the calculation of a number of quantities of interest, including absorption probabilities, expected hitting time and number of visits, and variances th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

سال: 2017

ISSN: 0278-0070,1937-4151

DOI: 10.1109/tcad.2017.2705117